Graph kernels and Gaussian processes for relational reinforcement learning
نویسندگان
چکیده
منابع مشابه
Reinforcement learning with kernels and Gaussian processes
Kernel methods have become popular in many sub-fields of machine learning with the exception of reinforcement learning; they facilitate rich representations, and enable machine learning techniques to work in diverse input spaces. We describe a principled approach to the policy evaluation problem of reinforcement learning. We present a temporal difference (TD) learning using kernel functions. Ou...
متن کاملGaussian Processes in Reinforcement Learning
We exploit some useful properties of Gaussian process (GP) regression models for reinforcement learning in continuous state spaces and discrete time. We demonstrate how the GP model allows evaluation of the value function in closed form. The resulting policy iteration algorithm is demonstrated on a simple problem with a two dimensional state space. Further, we speculate that the intrinsic abili...
متن کاملRelational Learning with Gaussian Processes
Correlation between instances is often modelled via a kernel function using input attributes of the instances. Relational knowledge can further reveal additional pairwise correlations between variables of interest. In this paper, we develop a class of models which incorporates both reciprocal relational information and input attributes using Gaussian process techniques. This approach provides a...
متن کاملRelational Gaussian Processes for Learning Preference Relations
Preference learning has received increasing attention in both machine learning and information retrieval. The goal of preference learning is to automatically learn a model to rank entities (e.g., documents, webpages, products, music, etc.) according to their degrees of relevance. The particularity of preference learning might be that the training data is a set of pairwise preferences between en...
متن کاملLearning Kernels over Strings using Gaussian Processes
Non-contiguous word sequences are widely known to be important in modelling natural language. However they are not explicitly encoded in common text representations. In this work we propose a model for text processing using string kernels, capable of flexibly representing non-contiguous sequences. Specifically, we derive a vectorised version of the string kernel algorithm and their gradients, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2006
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-006-8258-y